Towards a Characterization of Approximation Resistance for Symmetric CSPs
نویسندگان
چکیده
A Boolean constraint satisfaction problem (CSP) is called approximation resistant if independently setting variables to 1 with some probability α achieves the best possible approximation ratio for the fraction of constraints satisfied. We study approximation resistance of a natural subclass of CSPs that we call Symmetric Constraint Satisfaction Problems (SCSPs), where satisfaction of each constraint only depends on the number of true literals in its scope. Thus a SCSP of arity k can be described by a subset S⊆ {0,1, . . . ,k} of allowed number of true literals. For SCSPs without negation, we conjecture that a simple sufficient condition to be approximation resistant by Austrin and Håstad is indeed necessary. We show that this condition has a compact analytic representation in the case of symmetric CSPs (depending only on the gap between the largest and smallest numbers in S), and provide the rationale behind our conjecture. We prove two interesting special cases of the conjecture, (i) when S is an interval (i.e., S = {i | l 6 i 6 r} for some l 6 r) and (ii) when S is even (i.e., s ∈ S⇔ k− s ∈ S). For SCSPs with negation, we prove that the analogous sufficient condition by Austrin and Mossel is necessary for the same two cases, though we do not pose an analogous conjecture in general. ∗Supported in part by NSF grant CCF-1115525. [email protected] †Supported by a Samsung Fellowship and NSF CCF-1115525. [email protected] ISSN 1433-8092 Electronic Colloquium on Computational Complexity, Report No. 105 (2015)
منابع مشابه
Towards a Characterization of Constant-Factor Approximable Min CSPs
We study the approximability of Minimum Constraint Satisfaction Problems (Min CSPs) with a fixed finite constraint language Γ on an arbitrary finite domain. The goal in such a problem is to minimize the number of unsatisfied constraints in a given instance of CSP(Γ). A recent result of Ene et al. says that, under the mild technical condition that Γ contains the equality relation, the basic LP r...
متن کاملRandom approximation of a general symmetric equation
In this paper, we prove the Hyers-Ulam stability of the symmetric functionalequation $f(ph_1(x,y))=ph_2(f(x), f(y))$ in random normed spaces. As a consequence, weobtain some random stability results in the sense of Hyers-Ulam-Rassias.
متن کامل$n$-permutability and linear Datalog implies symmetric Datalog
In the last decade, algebraic methods have led to much progress in classifying the complexity of the non-uniform Constraint Satisfaction Problem (CSP). The programming language Datalog, whose origins lie in logic programming and database theory, has been playing an important role in classifying complexity of CSP since at least the classic paper of Feder and M. Vardi [10]. Feder and Vardi used D...
متن کاملA method to obtain the best uniform polynomial approximation for the family of rational function
In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 22 شماره
صفحات -
تاریخ انتشار 2015